- four color conjecture
- т. граф.гипотеза о четырёх красках
English-Russian scientific dictionary. 2008.
four color conjecture
Смотреть что такое "four color conjecture" в других словарях:
Four color theorem — Example of a four colored map A four colori … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Goldbach's conjecture — is one of the oldest unsolved problems in number theory and in all of mathematics. It states::Every even integer greater than 2 can be written as the sum of two primes.Expressing a given even number as a sum of two primes is called a Goldbach… … Wikipedia
Scheinerman's conjecture — In mathematics, Scheinerman s conjecture states that every planar graph is the intersection graph of a set of line segments in the plane. This conjecture was formulated by E. R. Scheinerman in his Ph.D. thesis (1984), following earlier results… … Wikipedia
Heawood conjecture — The Heawood conjecture or Ringel–Youngs theorem in graph theory gives an upper bound for the number of colors which are sufficient for graph coloring on a surface of a given genus. It was proven in 1968 by Gerhard Ringel and J. W. T. Youngs. One… … Wikipedia
Tait's conjecture — states that Every polyhedron has a Hamiltonian cycle (along the edges) through all its vertices . It was proposed in 1886 by P. G. Tait and disproved in 1946, when W. T. Tutte constructed a counterexample with 25 faces, 69 edges and 46 vertices.… … Wikipedia
Hedetniemi's conjecture — In graph theory, Hedetniemi s conjecture concerns the connection between graph coloring and the tensor product of graphs. This conjecture states that:χ( G × H ) = min {χ( G ), χ( H )}.Here χ( G ) denotes the chromatic number of an undirected… … Wikipedia
WMD conjecture in the aftermath of the 2003 Iraq War — v · … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Ruth Aaronson Bari — Ruth Bari Ruth Aaronson Bari (November 17, 1917 – August 25, 2005) was an American mathematician known for her work in graph theory and homomorphisms. The daughter of Polish Jewish immigrants to the U.S., she was a professor at George Washington… … Wikipedia
Heawood number — In mathematics, the Heawood number of a surface is a certain upper bound for the maximal number of colors needed to color any graph embedded in the surface. In 1890 Heawood proved for all surfaces except the sphere that no more than:… … Wikipedia
